Multigrid solver for axisymmetrical 2D fluid equations

We have developed an efficient algorithm for steady axisymmetrical 2D fluid equations. The algorithm employs multigrid method as well as standard implicit discretization schemes for systems of partial differential equations. Linearity of the multigrid method with respect to the number of grid points allowed us to use $256\times 256$ grid, where we could achieve solutions in several minutes. Time limitations due to nonlinearity of the system are partially avoided by using multi level grids(the initial solution on $256\times 256$ grid was extrapolated steady solution from $128\times 128$ grid which allowed using "long" integration time steps). The fluid solver may be used as the basis for hybrid codes for DC discharges.Comment: preliminary version; presented at 28 ICPIG, July 15-20, 2007, Prague, Czech Republi

Harvesting Entities from the Web Using Unique Identifiers -- IBEX

In this paper we study the prevalence of unique entity identifiers on the Web. These are, e.g., ISBNs (for books), GTINs (for commercial products), DOIs (for documents), email addresses, and others. We show how these identifiers can be harvested systematically from Web pages, and how they can be associated with human-readable names for the entities at large scale. Starting with a simple extraction of identifiers and names from Web pages, we show how we can use the properties of unique identifiers to filter out noise and clean up the extraction result on the entire corpus. The end result is a database of millions of uniquely identified entities of different types, with an accuracy of 73--96% and a very high coverage compared to existing knowledge bases. We use this database to compute novel statistics on the presence of products, people, and other entities on the Web.Comment: 30 pages, 5 figures, 9 tables. Complete technical report for A. Talaika, J. A. Biega, A. Amarilli, and F. M. Suchanek. IBEX: Harvesting Entities from the Web Using Unique Identifiers. WebDB workshop, 201

Algorithmic approach to adiabatic quantum optimization

It is believed that the presence of anticrossings with exponentially small gaps between the lowest two energy levels of the system Hamiltonian, can render adiabatic quantum optimization inefficient. Here, we present a simple adiabatic quantum algorithm designed to eliminate exponentially small gaps caused by anticrossings between eigenstates that correspond with the local and global minima of the problem Hamiltonian. In each iteration of the algorithm, information is gathered about the local minima that are reached after passing the anticrossing non-adiabatically. This information is then used to penalize pathways to the corresponding local minima, by adjusting the initial Hamiltonian. This is repeated for multiple clusters of local minima as needed. We generate 64-qubit random instances of the maximum independent set problem, skewed to be extremely hard, with between 10^5 and 10^6 highly-degenerate local minima. Using quantum Monte Carlo simulations, it is found that the algorithm can trivially solve all the instances in ~10 iterations.Comment: 7 pages, 3 figure

Dynamical structure factor of a nonlinear Klein-Gordon lattice

The quantum modes of a nonlinear Klein-Gordon lattice have been computed numerically [L. Proville, Phys. Rev. B 71, 104306 (2005)]. The on-site nonlinearity has been found to lead to phonon bound states. In the present paper, we compute numerically the dynamical structure factor so as to simulate the coherent scattering cross section at low temperature. The inelastic contribution is studied as a function of the on-site anharmonicity. Interestingly, our numerical method is not limited to the weak anharmonicity and permits one to study thoroughly the spectra of nonlinear phonons

Antioxidant activities of hydroxylated naphthalenes: the role of aryloxyl radicals

Herein is delineated a first systematic framework for the definition of structure-antioxidant property relationships in the dihydroxynaphthalene (DHN) series. The results obtained by a combined experimental and theoretical approach revealed that 1,8-DHN is the best performing antioxidant platform, with its unique hydrogen-bonded peri-hydroxylation pattern contributing to a fast H atom transfer process. Moreover, the comparative analysis of the antioxidant properties of DHNs carried out by performing DPPH and FRAP assays and laser flash photolysis experiments, revealed the higher antioxidant power associated with an α-substitution pattern (i. e. in 1,8- and 1,6-DHN) with respect to DHNs exhibiting a β-substitution pattern (i. e. in 2,6- and 2,7-DHN). DFT calculations and isolation and characterization of the main oligomer intermediates formed during the oxidative polymerization of DHNs supported this evidence by providing unprecedented insight into the generation and fate of the intermediate naphthoxyl radicals, which emerged as the main factor governing the antioxidant activity of DHNs

Data driven Xpath generation

The XPath query language offers a standard for information extraction from HTML documents. Therefore, the DOM tree represen- tation is typically used, which models the hierarchical structure of the document. One of the key aspects of HTML is the separation of data and the structure that is used to represent it. A consequence thereof is that data extraction algorithms usually fail to identify data if the structure of a document is changed. In this paper, it is investigated how a set of tab- ular oriented XPath queries can be adapted in such a way it deals with modifications in the DOM tree of an HTML document. The basic idea is hereby that if data has already been extracted in the past, it could be used to reconstruct XPath queries that retrieve the data from a different DOM tree. Experimental results show the accuracy of our method